Probabilistic Pharmaceutical Modelling: A Comparison Between Synchronous and Asynchronous Cellular Automata
نویسندگان
چکیده
The field of pharmaceutical modelling has, in recent years, benefited from using probabilistic methods based on cellular automata, which seek to overcome some of the limitations of differential equation based models. By modelling discrete structural element interactions instead, these are able to provide data quality adequate for the early design phases in drug modelling. In relevant literature, both synchronous (CA) and asynchronous (ACA) types of automata have been used, without analysing their comparative impact on the model outputs. In this paper, we compare several variations of probabilistic CA and ACA update algorithms for building models of complex systems used in controlled drug delivery, analysing the advantages and disadvantages related to different modelling scenarios. Choosing the appropriate update mechanism, besides having an impact on the perceived realism of the simulation, also has practical benefits on the applicability of different model parallelisation algorithms and their performance when used in large-scale simulation contexts.
منابع مشابه
Comparative analysis of asynchronous cellular automata in stochastic pharmaceutical modelling
In pharmaceutical modelling, cellular automata have been used as an established tool to represent molecular changes through discrete structural interactions. The data quality provided by such modelling is found suitable for the early drug design phase where flexibility is paramount. While both synchronous (CA) and asynchronous (ACA) types of automata have been used, analysis of their nature and...
متن کاملParallel Simulation of Asynchronous Cellular Automata Evolution
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as Monte-Carlo methods. The simulation requires huge cellular space and millions of iterative steps for obtaining the CA evolution representing the real scene of the process. This may be achieved by allocating the CA evo...
متن کاملUniversality Class of Probabilistic Cellular Automata
The Ising-like phase transition is considered in probabilistic cellular automata (CA). The nonequilibrium CA with Toom rule are compared to standard equilibrium lattice systems to verify influence of synchronous vs asynchronous updating. It was observed by Marcq et al. [Phys.Rev.E 55(1997) 2606] that the mode of updating separates systems of coupled map lattices into two distinct universality c...
متن کاملEvolving Robust Asynchronous Cellular Automata for the Density Task
In this paper the evolution of three kinds of asynchronous cellular automata are studied for the density task. Results are compared with those obtained for synchronous automata and the influence of various asynchronous update policies on the computational strategy is described. How synchronous and asynchronous cellular automata behave is investigated when the update policy is gradually changed,...
متن کاملTowards Team-Automata-Driven Object-Oriented Collaborative Work
The paper studies and compares two different approaches to model communication and cooperation. The approaches are team automata, a well-defined variant of communicating automata, and statecharts, heavily used in object-oriented modelling methods. The comparison yields interesting insights for modelling communication and cooperation. In particular, the differences between action-based, synchron...
متن کامل